Quantum information inequalities via tracial positive linear maps
نویسندگان
چکیده
Abstract. We present some generalizations of quantum information inequalities involving tracial positive linear maps between C∗-algebras. Among several results, we establish a noncommutative Heisenberg uncertainty relation. More precisely, we show that if Φ : A → B is a tracial positive linear map between C∗-algebras , ρ ∈ A is a Φ-density element and A,B are self-adjoint operators of A such that sp(-iρ 1 2 [A,B]ρ 1 2 ) ⊆ [m,M ] for some scalers 0 < m < M , then under some conditions
منابع مشابه
Constacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملFree Fisher Information for Non-tracial States
We extend Voiculescu’s microstates-free definitions of free Fisher information and free entropy to the non-tracial framework. We explain the connection between these quantities and free entropy with respect to certain completely positive maps acting on the core of the non-tracial non-commutative probability space. We give a condition on free Fisher information of an infinite family of variables...
متن کاملPositive maps, majorization, entropic inequalities, and detection of entanglement
In this paper, we discuss some general connections between the notions of positive map, weak majorization and entropic inequalities in the context of detection of entanglement among bipartite quantum systems. First, basing on the fact that any positive map Λ : Md(C) → Md(C) can be written as the difference between two completely positive maps Λ = Λ1 − Λ2, we propose a possible way to generalize...
متن کاملBounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
In this paper we study bipartite quantum correlations using techniques from tracial polynomial optimization. We construct a hierarchy of semidefinite programming lower bounds on the minimal entanglement dimension of a bipartite correlation. This hierarchy converges to a new parameter: the minimal average entanglement dimension, which measures the amount of entanglement needed to reproduce a qua...
متن کاملTrace-positive polynomials, sums of hermitian squares and the tracial moment problem
A polynomial f in non-commuting variables is trace-positive if the trace of f(A) is positive for all tuples A of symmetric matrices of the same size. The investigation of trace-positive polynomials and of the question of when they can be written as a sum of hermitian squares and commutators of polynomials are motivated by their connection to two famous conjectures: The BMV conjecture from stati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1610.03929 شماره
صفحات -
تاریخ انتشار 2016